Use Coupled LSTM Networks to Solve Constrained Optimization Problems
نویسندگان
چکیده
منابع مشابه
A Simple Evolution Strategy to Solve Constrained Optimization Problems
In this paper, we argue that the self-adaptation mechanism of a conventional evolution strategy combined with some (very simple) tournament rules based on feasibility similar to some previous proposals (e.g., [1]) can provide us with a highly competitive evolutionary algorithm for constrained optimization. In our proposal, however, no extra mechanisms are provided to maintain diversity. In orde...
متن کاملμJADEε: Micro adaptive differential evolution to solve constrained optimization problems
A highly competitive micro evolutionary algorithm to solve unconstrained optimization problems called μJADE (micro adaptive differential evolution), is adapted to deal with constrained search spaces. Two constraint-handling techniques (the feasibility rules and the ε-constrained method) are tested in μJADE and their performance is analyzed. The most competitive version is then compared against ...
متن کاملOn the Use of Non-Stationary Penalty Functions to Solve Nonlinear Constrained Optimization Problems with GA's
In this paper we discuss the use of non-stationary penalty functions to solve general nonlinear programming problems (NP) using real-valued GAS. The non-stationary penalty is a function of the generation number; as the number of generations increases so does the penalty. Therefore, as the penalty increases it puts more and more selective pressure on the GA to find a feasible solution. The ideas...
متن کاملHierarchies to Solve Constrained Connected Spanning Problems
Given a graph and a set of vertices, searching for a connected and minimum cost structure which spans the vertices is a classic problem. When no constraints are applied, the minimum cost spanning structure is a sub-graph corresponding to a tree. If all the vertices in the graph should be spanned the problem is referred to as minimum spanning tree (MST) construction and polynomial time algorithm...
متن کاملModified particle swarm optimization algorithm to solve location problems on urban transportation networks (Case study: Locating traffic police kiosks)
Nowadays, traffic congestion is a big problem in metropolises all around the world. Traffic problems rise with the rise of population and slow growth of urban transportation systems. Car accidents or population concentration in particular places due to urban events can cause traffic congestions. Such traffic problems require the direct involvement of the traffic police, and it is urgent for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cognitive Communications and Networking
سال: 2023
ISSN: ['2332-7731', '2372-2045']
DOI: https://doi.org/10.1109/tccn.2022.3228584